Information Seeking Behavior in Peer-to-Peer Networks: An ExploratoryStudy

نویسندگان

  • K. Y. Chan
  • S. H. Kwok
چکیده

Digital Library (DL) has become a mean to distribute multimedia contents in the networked information environment. Previous researchers have suggested ways to improve the design of multimedia DLs, however, users’ information seeking behavior is often neglected. Existing studies on users’ searching behavior do not provide any insights specifically into the behavior of users searching for multimedia contents, therefore, we intend to address this issue by conducting experiments in peer-to-peer (P2P) networks, in which multimedia contents are extensively shared. Anonymity, one of the characteristics of P2P networks, has hindered previous researchers from studying individuals’ information seeking behavior. In this paper, we propose a methodology to identify users’ search sessions and capture their searching behavior in P2P networks at the level of individuals. Our preliminary results show that when users search for multimedia files, they are likely to submit successive queries in the same topic. The results of this study will be instrumental in providing ways of understanding users’ information seeking behavior and incorporating human factors into the design of DLs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Adoption of Scientific Poultry Farming Practices by the Broiler Farmers in Haryana, India

The present study was undertaken on 125 broiler farmers randomly selected from five districts, Hisar, Jind, Fatehabad, Sirsa and Bhiwani of Hisar division of Haryana to assess extent of adoption of various scientific practices by the broiler farmers. The package of practices recommended by regional state agricultural university was adopted as the set of scientific practices. The information was...

متن کامل

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004